Circular Separability of Polygons
نویسندگان
چکیده
منابع مشابه
Dynamic circle separability between convex polygons
Let P, Q be two polygons of n and m vertices respectively. A circle containing P and whose interior does not intersect Q is called a separating circle. We propose an algorithm for finding the minimum separating circle between a fixed convex polygon P and query convex polygon Q. P and Q are given as ordered lists of vertices (sorted according to their order of appearance along the convex hulls o...
متن کاملPolygons Cuttable by a Circular Saw
We introduce and characterize a new class of polygons that models wood, stone, glass, and ceramic shapes that can be cut with a table saw, lapidary trim saw, or other circular saw. In this model, a circular saw is a line segment (in projection) that can move freely in empty space, but can only cut straight into a portion of material. Once a region of material is separated from the rest, it can ...
متن کاملCutting Out Polygons with a Circular Saw
Given a simple (cuttable) polygon Q drawn on a piece of planar material R, we cut Q out of R by a (small) circular saw with a total number of cuts no more than twice the optimal. This improves the previous approximation ratio of 2.5 obtained by Demaine et al. in 2001.
متن کاملFast Combined Separability Filter for Detecting Circular Objects
In this paper, we propose a fast combined separability filter, which can selectively detect circular features such as pupils and nostrils in an image of the human face. The proposed filter is designed as a combination of multiple rectangle separability filters so that it can achieve high-speed processing and high positioning accuracy at the same time. The evaluation experiments using synthetic ...
متن کاملHierarchical Decompositions and Circular Ray Shooting in Simple Polygons
A hierarchical decomposition of a simple polygon is introduced. The hierarchy has depth O(log n), linear size, and its regions have at most three neighbors. Using this hierarchy, circular ray shooting queries in a simple polygon can be answered in O(log n) query time and O(n log n) space. If the radius of the circle is xed, the query time can be improved to O(log n) and the space to O(n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2001
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s004530010078